package 笔试;

import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeMap;

public class 小红书_最小过路费用 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int k = scan.nextInt();

        scan.nextLine();
        int[] N = new int[m];
        for (int i = 0; i < m; i++) {
            N[i] = scan.nextInt();
        }
        scan.nextLine();
        int[] M = new int[m];
        for (int i = 0; i < m; i++) {
            M[i] = scan.nextInt();
        }
        scan.nextLine();
        int[] K = new int[m];
        for (int i = 0; i < m; i++) {
            K[i] = scan.nextInt();
        }

        int[][] arr = new int[m][2];
        for (int i = 0; i < m; i++) {
            arr[i][0] = N[i];
            arr[i][1] = M[i];
        }

        
    }
}
